On Well-posed Mutually Nearest and Mutually Furthest Point Problems in Banach Spaces

نویسندگان

  • Chong LI
  • Ren Xing NI
چکیده

Let G be a non-empty closed (resp. bounded closed) boundedly relatively weakly compact subset in a strictly convex Kadec Banach space X. Let K(X) denote the space of all non-empty compact convex subsets of X endowed with the Hausdorff distance. Moreover, let KG(X) denote the closure of the set {A ∈ K(X) : A∩G = ∅}. We prove that the set of all A ∈ KG(X) (resp. A ∈ K(X)), such that the minimization (resp. maximization) problem min(A,G) (resp. max(A,G)) is well posed, contains a dense Gδ-subset of KG(X) (resp. K(X)), thus extending the recent results due to Blasi, Myjak and Papini and Li.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Almost Well-posed Mutually Nearest and Mutually Furthest Point Problems

Let G be a nonempty closed (resp. bounded closed) subset in a strongly convex Banach space X. Let BðXÞ denote the space of all nonempty bounded closed subsets of X endowed with the Hausdorff distance and let BGðXÞ denote the closure of the set fA 2 BðXÞ : A \ G 1⁄4 ;g. We prove that E(G) (resp. Eo(G)), the set of all A 2 BGðXÞ (resp. A 2 BðXÞ) such that the minimization (resp. maximization) pro...

متن کامل

Porosity of mutually nearest and mutually furthest points in Banach spaces

Let X be a real strictly convex and Kadec Banach space and G a nonempty closed relatively boundedly weakly compact subset of X : Let BðX Þ (resp. KðXÞ) be the family of nonempty bounded closed (resp. compact) subsets of X endowed with the Hausdorff distance and let BGðXÞ denote the closure of the set fAABðX Þ : A-G 1⁄4 |g and KGðX Þ 1⁄4 BGðX Þ-KðXÞ: We introduce the admissible family A of BðX Þ...

متن کامل

Nearest and farthest points in spaces of curvature bounded below

Let A be a nonempty closed subset (resp. nonempty bounded closed subset) of a metric space (X, d) and x ∈ X \ A. The nearest point problem (resp. the farthest point problem) w.r.t. x considered here is to find a point a0 ∈ A such that d(x, a0) = inf{d(x, a) : a ∈ A} (resp. d(x, a0) = sup{d(x, a) : a ∈ A}). We study the well posedness of nearest point problems and farthest point problems in geod...

متن کامل

A Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces

Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...

متن کامل

Isometric Decompositions

The study of decompositions of sets in U, n ^ 1, into disjoint, mutually isometric subsets has a long and distinguished history. In 1928 J. von Neumann [2] proved that an interval in U (with or without endpoints) is decomposable into Ko disjoint sets which are mutually isometric under translations. In 1951 W. Gustin [1] proved that no such decomposition into n, 2 ^ n < No, sets is possible. A b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004